-
1 graph theoretic problem
Вычислительная техника: задача теории графовУниверсальный англо-русский словарь > graph theoretic problem
-
2 graph-theoretic problem
Математика: задача теории графовУниверсальный англо-русский словарь > graph-theoretic problem
-
3 graph theoretic problem
English-Russian dictionary of computer science and programming > graph theoretic problem
-
4 graph-theoretic problem
мат.English-Russian scientific dictionary > graph-theoretic problem
-
5 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
6 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
7 задача теории графов
Большой англо-русский и русско-английский словарь > задача теории графов
-
8 model
1) модель; модификация2) модель (образец; уменьшенная, упрощенная копия)3) модель (абстрактная схема; концепция)•- access control model
- adaptive model
- aggregated model
- algoristic-type model
- allocation model
- analytical model
- ANOVA model
- behavioral model
- birth-death model
- block-diagram model - capability maturity model
- cascade-based model
- causal model
- client/server model
- client-component model
- client-server model
- cognitive model
- computer model
- conceptual model
- controllable model
- correlative model
- cost estimation model
- crude model
- cybernetic model
- data model
- decision-theoretic model
- decision-tree model
- descriptive model
- design model
- desk model
- deterministic model - domain semantic model
- dynamic programming model
- E/R model
- econometric model
- elaborate model
- elemental-equivalent model
- entity set model
- entity-relationship model
- equilibrium model
- estimation model
- exhaustive fault model
- exogenous priority model
- external model
- fault model
- fault-effect model
- finite element model
- fixed cascade delay model
- fixed gate delay model
- flow-oriented model
- forecasting model
- formal model
- frame-based model
- functional model
- gaming model
- gate-based model
- gate-level model
- generalized model
- generic model
- geometrical model
- graph model
- hardware model
- hazard function model
- hazard model
- heuristic model
- hierarchical model
- iconographic model
- internal model
- layout model
- level-based model
- linear programming model
- linear word-level model
- many-server model
- mental model
- MILP model
- model of calculation
- model of knowledge
- Monte-Carlo model
- multiple model
- multivariate model
- network model
- object model
- object-centric model
- OSI reference model
- pandemonium model
- performance-based model
- phenomenological model
- pictorial model
- pilot model
- pin fault model
- predictive model
- preemptive model
- preliminary model
- preproduction model
- priority model
- probabilistic model
- problem model - quantitative model
- queueing model
- real world model
- relational model
- relative model
- reliability model
- role-playing model
- scaling model
- scheduling model
- security model
- semi-Markov model
- seven-layer model
- shaded model
- simplified model
- simulation model
- single-stuck fault model
- singular model
- software model
- solid model
- sophisticated model
- state-space model
- statistical model
- stochastic model
- stream of characters model
- structural model
- stuck-at model
- suspect/monitor model
- symbolic model
- table model
- task-network model
- timing model
- transformational model
- typewriter model
- vocal-tract model
- waiting line model
- waterfall model
- wire-frame model
- word-level model
- world modelEnglish-Russian dictionary of computer science and programming > model
-
9 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method
См. также в других словарях:
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph homomorphism — Not to be confused with graph homeomorphism. In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. Contents 1… … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Ménage problem — A table with ten place settings. According to the solution to the ménage problem, there are 3120 different ways in which five couples can choose seats at this table in such a way that men and women alternate and do not sit next to their partners … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Hadwiger–Nelson problem — Unsolved problems in mathematics How many colors are needed to color the plane so that no two points at unit distance are the same color? In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks… … Wikipedia
Unit distance graph — In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one.… … Wikipedia
